矩阵代数收敛至球面与非交换度量几何

介绍了Rieffel定义的紧致量子度量空间与量子Gromov-Hausdorff距离和近来Latrémolière定义的量子Gromov-Hausdorff邻距,分别讨论了矩阵代数如何在这两种量子距离下收敛至球面.     

A fast discontinuous finite element discretization for the space‐time fractional diffusion‐wave equation

In this article, we study fast discontinuous Galerkin finite element methods to solve a space‐time fractional diffusion‐wave equation. We introduce a piecewise‐constant discontinuous finite element method for solving this problem and derive optimal error estimates. Importantly, a fast solution technique to accelerate Toeplitz matrix‐vector multiplications which arise from discontinuous Galerkin finite element discretization is developed. This fast solution technique is based on fast Fourier transform and it depends on the special structure of coefficient matrices. In each temporal step, it helps to reduce the computational work from required by the traditional methods to log , where is the size of the coefficient matrices (number of spatial grid points). Moreover, the applicability and accuracy of the method are verified by numerical experiments including both continuous and discontinuous examples to support our theoretical analysis.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2043–2061, 2017     

One‐dimensional q‐Dirac equation

In this paper, we introduce a q‐analog of 1‐dimensional Dirac equation. We investigate the existence and uniqueness of the solution of this equation. Later, we discuss some spectral properties of the problem, such as formally self‐adjointness, the case that the eigenvalues are real, orthogonality of eigenfunctions, Green function, existence of a countable sequence of eigenvalues, and eigenfunctions forming an orthonormal basis of . Finally, we give some examples.     

椭圆PDE-约束优化问题的一个预条件子

针对由Galerkin有限元离散椭圆PDE-约束优化问题产生的具有特殊结构的3×3块线性鞍点系统,提出了一个预条件子并给出了预处理矩阵特征值及特征向量的具体表达形式.数值结果表明了该预条件子能够有效地加速Krylov子空间方法的收敛速率,同时也验证了理论结果.     

关于稳定矩阵分解定理的一个简单证明

一个矩阵称为稳定的,如果这个矩阵的特征值全包含在单位开圆盘内.利用Parker关于复方阵的分解定理给出了稳定矩阵分解定理的一个简单证明,并对奇异值全部严格小于1的矩阵给出了类似的结论.     

一类含时滞的比率依赖捕食系统正平衡点的全局稳定性分析

讨论了一种食饵增长为Gilpin-Ayala型的比率依赖的食饵捕食者模型,利用第二加性复合矩阵原理证明线性化系统正轨道解的稳定性,结合系统在凸集中存在唯一的局部正平衡点,证明了正平衡点的全局渐近稳定性.结合数值模拟验证了所得结论的合理性,同时指出定理结论仅为充分条件,丰富完善了模型的动力学性质.     

基于几何过程和位相分布休假的两部件并联可修系统的可靠性分析

主要以两不同型部件组成的并联可修系统为研究对象.在系统对失效相位存在记忆的基础上,考虑了修理工可单重休假且休假时间服从位相(PH)分布.每个工作部件均有可能因受到两种不同类型的故障而失效,且均"修复非新".在假定部件的工作时间,修理时间分别服从PH分布的几何过程和负指数分布的条件下,利用马尔可夫过程和矩阵分析的方法,对可修系统进行了可靠性分析,并给出了相应可靠性指标的数值算例.     

浅析几类双输入排队系统模型

从矩阵几何解的角度出发,分析了七种类型的Geom/Geom/(Geom/Geom)/H 双输入排队系统.对这几个模型进行了描述,使用拟生灭过程探讨了各类模型的矩阵结构,并给出了其状态转移概率矩阵.     

基于严格α-双链对角占优矩阵的非奇H-矩阵的判定准则

研究了非奇H-矩阵的判定问题.先给出了几个判定严格α-双链对角占优矩阵的充要条件,进一步利用矩阵对角占优理论得到了判定非奇H-矩阵的一些充分条件,推广和改进了已有的相关结果,并用数值算例说明了这些判定方法的有效性.     

Local reconstruction of low‐rank matrices and subspaces

We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field and the goal is to reconstruct a (near‐optimal) matrix that is low‐rank and close to M under some distance function Δ. Furthermore, the reconstruction must be local, i.e., provides access to any desired entry of by reading only a few entries of the input M (ideally, independent of the matrix dimensions n and m). Our formulation of this problem is inspired by the local reconstruction framework of Saks and Seshadhri (SICOMP, 2010). Our main result is a local reconstruction algorithm for the case where Δ is the normalized Hamming distance (between matrices). Given M that is ‐close to a matrix of rank (together with d and ), this algorithm computes with high probability a rank‐d matrix that is ‐close to M. This is a local algorithm that proceeds in two phases. The preprocessing phase reads only random entries of M, and stores a small data structure. The query phase deterministically outputs a desired entry by reading only the data structure and 2d additional entries of M. We also consider local reconstruction in an easier setting, where the algorithm can read an entire matrix column in a single operation. When Δ is the normalized Hamming distance between vectors, we derive an algorithm that runs in polynomial time by applying our main result for matrix reconstruction. For comparison, when Δ is the truncated Euclidean distance and , we analyze sampling algorithms by using statistical learning tools. A preliminary version of this paper appears appears in ECCC, see: http://eccc.hpi-web.de/report/2015/128/ © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 607–630, 2017